Maximum Cardinality Matching
نویسنده
چکیده
A matching in a graph G is a subset M of the edges of G such that no two share an endpoint. A matching has maximum cardinality if its cardinality is at least as large as that of any other matching. An odd-set cover OSC of a graph G is a labeling of the nodes of G with integers such that every edge of G is either incident to a node labeled 1 or connects two nodes labeled with the same number i ≥ 2. Theorem 1 (Edmonds [2]). Let M be a matching in a graph G and let OSC be an odd-set cover of G. For any i ≥ 0, let ni be the number of nodes labeled i. If
منابع مشابه
Maximum Cardinality Matching by Evolutionary Algorithms
The analysis of time complexity of evolutionary algorithms has always focused on some artificial binary problems. This paper considers the average time complexity of an evolutionary algorithm for maximum cardinality matching in a graph. It is shown that the evolutionary algorithm can produce matchings with nearly maximum cardinality in average polynomial time.
متن کاملThe Weighted Matching Approach to Maximum Cardinality Matching
Several papers have achieved time O( √ nm) for cardinality matching, starting from first principles. This results in a long derivation. We simplify the task by employing well-known concepts for maximum weight matching. We use Edmonds’ algorithm to derive the structure of shortest augmenting paths. We extend this to a complete algorithm for maximum cardinality matching in time O( √ nm).
متن کاملPopular Matchings in the Stable Marriage Problem
The input is a bipartite graph G = (A ∪B ,E) where each vertex u ∈ A ∪B ranks its neighbors in a strict order of preference. This is the same as an instance of the stable marriage problem with incomplete lists. A matching M∗ is said to be popular if there is no matching M such that more vertices are better off in M than in M∗. Any stable matching of G is popular, however such a matching is a mi...
متن کاملDRAFT - - DRAFT - - DRAFT - - DRAFT - - DRAFT - - 1 Time Complexity of Maximum Matching by an ( N + N ) Evolutionary Algorithm
An (N +N) evolutionary algorithm is considered for the problem of finding the maximum cardinality matching in a graph. It is shown that the performance of the evolutionary algorithm is the same as classical simulated annealing. That is, the evolutionary algorithm cannot find the maximum matching in polynomial average time for a family of bipartite graphs considered in this paper although there ...
متن کاملPopularity vs maximum cardinality in the stable marriage setting
Given a bipartite graph G = (A ∪ B, E) where each vertex ranks its neighbors in a strict order of preference, we consider the problem of computing a largest matching in the set of popular matchings in G. A matching M is said to be popular if there is no matching where more vertices are happier than in M . The set of popular matchings is non-empty since every stable matching is popular and it is...
متن کاملAn O(log(n)) Fully Dynamic Algorithm for Maximum matching in a tree
In this paper, we have developed a fully-dynamic algorithm for maintaining cardinality of maximum-matching in a tree using the construction of top-trees. The time complexities are as follows: 1. Initialization Time: O(n(log(n))) to build the Top-tree. 2. Update Time: O(log(n)) 3. Query Time: O(1) to query the cardinality of maximum-matching and O(log(n)) to find if a particular edge is matched.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011